Simple Forcing Notions and Forcing Axioms
نویسندگان
چکیده
منابع مشابه
Anti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملBaumgartner's conjecture and bounded forcing axioms
We study the spectrum of forcing notions between the iterations of σ-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of α-proper forcings for indecomposable countable ordinals α, the Axiom A forcings and forcings completely embeddable into an iteration of a σ-closed followed by a ccc forcing. For the latter class, we present an equivalent characterization in...
متن کاملBounded Forcing Axioms and Baumgartner’s Conjecture
We study the spectrum of forcing notions between the iterations of σ-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of α-proper forcings for indecomposable countable ordinals α as well as the Axiom A forcings. We focus on the bounded forcing axioms for the hierarchy of αproper forcings. Following ideas of Shelah we separate them for distinct countable indec...
متن کاملGeneric Σ 1 3 Absoluteness
In this article we study the strength of Σ 1 3 absoluteness (with real parameters) in various types of generic extensions, correcting and improving some results from [2]. We shall also make some comments relating this work to the bounded forcing axioms BMM, BPFA and BSPFA. The statement " Σ 1 3 absoluteness holds for ccc forcing " means that if a Σ 1 3 formula with real parameters has a solutio...
متن کاملComplete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 62 شماره
صفحات -
تاریخ انتشار 1997